Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > isf32lem3 | Structured version Visualization version GIF version |
Description: Lemma for isfin3-2 9789. Being a chain, difference sets are disjoint (one case). (Contributed by Stefan O'Rear, 5-Nov-2014.) |
Ref | Expression |
---|---|
isf32lem.a | ⊢ (𝜑 → 𝐹:ω⟶𝒫 𝐺) |
isf32lem.b | ⊢ (𝜑 → ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ⊆ (𝐹‘𝑥)) |
isf32lem.c | ⊢ (𝜑 → ¬ ∩ ran 𝐹 ∈ ran 𝐹) |
Ref | Expression |
---|---|
isf32lem3 | ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → (((𝐹‘𝐴) ∖ (𝐹‘suc 𝐴)) ∩ ((𝐹‘𝐵) ∖ (𝐹‘suc 𝐵))) = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eldifi 4103 | . . . 4 ⊢ (𝑎 ∈ ((𝐹‘𝐴) ∖ (𝐹‘suc 𝐴)) → 𝑎 ∈ (𝐹‘𝐴)) | |
2 | simpll 765 | . . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → 𝐴 ∈ ω) | |
3 | peano2 7602 | . . . . . . 7 ⊢ (𝐵 ∈ ω → suc 𝐵 ∈ ω) | |
4 | 3 | ad2antlr 725 | . . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → suc 𝐵 ∈ ω) |
5 | nnord 7588 | . . . . . . . 8 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
6 | 5 | ad2antrr 724 | . . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → Ord 𝐴) |
7 | simprl 769 | . . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → 𝐵 ∈ 𝐴) | |
8 | ordsucss 7533 | . . . . . . 7 ⊢ (Ord 𝐴 → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴)) | |
9 | 6, 7, 8 | sylc 65 | . . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → suc 𝐵 ⊆ 𝐴) |
10 | simprr 771 | . . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → 𝜑) | |
11 | isf32lem.a | . . . . . . 7 ⊢ (𝜑 → 𝐹:ω⟶𝒫 𝐺) | |
12 | isf32lem.b | . . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ⊆ (𝐹‘𝑥)) | |
13 | isf32lem.c | . . . . . . 7 ⊢ (𝜑 → ¬ ∩ ran 𝐹 ∈ ran 𝐹) | |
14 | 11, 12, 13 | isf32lem1 9775 | . . . . . 6 ⊢ (((𝐴 ∈ ω ∧ suc 𝐵 ∈ ω) ∧ (suc 𝐵 ⊆ 𝐴 ∧ 𝜑)) → (𝐹‘𝐴) ⊆ (𝐹‘suc 𝐵)) |
15 | 2, 4, 9, 10, 14 | syl22anc 836 | . . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → (𝐹‘𝐴) ⊆ (𝐹‘suc 𝐵)) |
16 | 15 | sseld 3966 | . . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → (𝑎 ∈ (𝐹‘𝐴) → 𝑎 ∈ (𝐹‘suc 𝐵))) |
17 | elndif 4105 | . . . 4 ⊢ (𝑎 ∈ (𝐹‘suc 𝐵) → ¬ 𝑎 ∈ ((𝐹‘𝐵) ∖ (𝐹‘suc 𝐵))) | |
18 | 1, 16, 17 | syl56 36 | . . 3 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → (𝑎 ∈ ((𝐹‘𝐴) ∖ (𝐹‘suc 𝐴)) → ¬ 𝑎 ∈ ((𝐹‘𝐵) ∖ (𝐹‘suc 𝐵)))) |
19 | 18 | ralrimiv 3181 | . 2 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → ∀𝑎 ∈ ((𝐹‘𝐴) ∖ (𝐹‘suc 𝐴)) ¬ 𝑎 ∈ ((𝐹‘𝐵) ∖ (𝐹‘suc 𝐵))) |
20 | disj 4399 | . 2 ⊢ ((((𝐹‘𝐴) ∖ (𝐹‘suc 𝐴)) ∩ ((𝐹‘𝐵) ∖ (𝐹‘suc 𝐵))) = ∅ ↔ ∀𝑎 ∈ ((𝐹‘𝐴) ∖ (𝐹‘suc 𝐴)) ¬ 𝑎 ∈ ((𝐹‘𝐵) ∖ (𝐹‘suc 𝐵))) | |
21 | 19, 20 | sylibr 236 | 1 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ∈ 𝐴 ∧ 𝜑)) → (((𝐹‘𝐴) ∖ (𝐹‘suc 𝐴)) ∩ ((𝐹‘𝐵) ∖ (𝐹‘suc 𝐵))) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∀wral 3138 ∖ cdif 3933 ∩ cin 3935 ⊆ wss 3936 ∅c0 4291 𝒫 cpw 4539 ∩ cint 4876 ran crn 5556 Ord word 6190 suc csuc 6193 ⟶wf 6351 ‘cfv 6355 ωcom 7580 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-tr 5173 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fv 6363 df-om 7581 |
This theorem is referenced by: isf32lem4 9778 |
Copyright terms: Public domain | W3C validator |