Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tz7.2 | Structured version Visualization version GIF version |
Description: Similar to Theorem 7.2 of [TakeutiZaring] p. 35, of except that the Axiom of Regularity is not required due to antecedent E Fr 𝐴. (Contributed by NM, 4-May-1994.) |
Ref | Expression |
---|---|
tz7.2 | ⊢ ((Tr 𝐴 ∧ E Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | trss 4689 | . . 3 ⊢ (Tr 𝐴 → (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴)) | |
2 | efrirr 5019 | . . . . 5 ⊢ ( E Fr 𝐴 → ¬ 𝐴 ∈ 𝐴) | |
3 | eleq1 2676 | . . . . . 6 ⊢ (𝐵 = 𝐴 → (𝐵 ∈ 𝐴 ↔ 𝐴 ∈ 𝐴)) | |
4 | 3 | notbid 307 | . . . . 5 ⊢ (𝐵 = 𝐴 → (¬ 𝐵 ∈ 𝐴 ↔ ¬ 𝐴 ∈ 𝐴)) |
5 | 2, 4 | syl5ibrcom 236 | . . . 4 ⊢ ( E Fr 𝐴 → (𝐵 = 𝐴 → ¬ 𝐵 ∈ 𝐴)) |
6 | 5 | necon2ad 2797 | . . 3 ⊢ ( E Fr 𝐴 → (𝐵 ∈ 𝐴 → 𝐵 ≠ 𝐴)) |
7 | 1, 6 | anim12ii 592 | . 2 ⊢ ((Tr 𝐴 ∧ E Fr 𝐴) → (𝐵 ∈ 𝐴 → (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ 𝐴))) |
8 | 7 | 3impia 1253 | 1 ⊢ ((Tr 𝐴 ∧ E Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ⊆ wss 3540 Tr wtr 4680 E cep 4947 Fr wfr 4994 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-tr 4681 df-eprel 4949 df-fr 4997 |
This theorem is referenced by: tz7.7 5666 trelpss 37680 |
Copyright terms: Public domain | W3C validator |