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, except that the Axiom of Regularity is not required due to the antecedent E Fr 𝐴. (Contributed by NM, 4-May-1994.) |
Ref | Expression |
---|---|
tz7.2 | ⊢ ((Tr 𝐴 ∧ E Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | trss 5200 | . . 3 ⊢ (Tr 𝐴 → (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴)) | |
2 | efrirr 5570 | . . . . 5 ⊢ ( E Fr 𝐴 → ¬ 𝐴 ∈ 𝐴) | |
3 | eleq1 2826 | . . . . . 6 ⊢ (𝐵 = 𝐴 → (𝐵 ∈ 𝐴 ↔ 𝐴 ∈ 𝐴)) | |
4 | 3 | notbid 318 | . . . . 5 ⊢ (𝐵 = 𝐴 → (¬ 𝐵 ∈ 𝐴 ↔ ¬ 𝐴 ∈ 𝐴)) |
5 | 2, 4 | syl5ibrcom 246 | . . . 4 ⊢ ( E Fr 𝐴 → (𝐵 = 𝐴 → ¬ 𝐵 ∈ 𝐴)) |
6 | 5 | necon2ad 2958 | . . 3 ⊢ ( E Fr 𝐴 → (𝐵 ∈ 𝐴 → 𝐵 ≠ 𝐴)) |
7 | 1, 6 | anim12ii 618 | . 2 ⊢ ((Tr 𝐴 ∧ E Fr 𝐴) → (𝐵 ∈ 𝐴 → (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ 𝐴))) |
8 | 7 | 3impia 1116 | 1 ⊢ ((Tr 𝐴 ∧ E Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ⊆ wss 3887 Tr wtr 5191 E cep 5494 Fr wfr 5541 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-11 2154 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-tr 5192 df-eprel 5495 df-fr 5544 |
This theorem is referenced by: tz7.7 6292 trelpss 42073 |
Copyright terms: Public domain | W3C validator |