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 4761 | . . 3 ⊢ (Tr 𝐴 → (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴)) | |
2 | efrirr 5095 | . . . . 5 ⊢ ( E Fr 𝐴 → ¬ 𝐴 ∈ 𝐴) | |
3 | eleq1 2689 | . . . . . 6 ⊢ (𝐵 = 𝐴 → (𝐵 ∈ 𝐴 ↔ 𝐴 ∈ 𝐴)) | |
4 | 3 | notbid 308 | . . . . 5 ⊢ (𝐵 = 𝐴 → (¬ 𝐵 ∈ 𝐴 ↔ ¬ 𝐴 ∈ 𝐴)) |
5 | 2, 4 | syl5ibrcom 237 | . . . 4 ⊢ ( E Fr 𝐴 → (𝐵 = 𝐴 → ¬ 𝐵 ∈ 𝐴)) |
6 | 5 | necon2ad 2809 | . . 3 ⊢ ( E Fr 𝐴 → (𝐵 ∈ 𝐴 → 𝐵 ≠ 𝐴)) |
7 | 1, 6 | anim12ii 594 | . 2 ⊢ ((Tr 𝐴 ∧ E Fr 𝐴) → (𝐵 ∈ 𝐴 → (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ 𝐴))) |
8 | 7 | 3impia 1261 | 1 ⊢ ((Tr 𝐴 ∧ E Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ⊆ wss 3574 Tr wtr 4752 E cep 5028 Fr wfr 5070 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-tr 4753 df-eprel 5029 df-fr 5073 |
This theorem is referenced by: tz7.7 5749 trelpss 38659 |
Copyright terms: Public domain | W3C validator |