![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > no2indslem | Structured version Visualization version GIF version |
Description: Double induction on surreals with explicit notation for the relationships. (Contributed by Scott Fenton, 22-Aug-2024.) |
Ref | Expression |
---|---|
no2indslem.a | ⊢ 𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))} |
no2indslem.1 | ⊢ (𝑥 = 𝑧 → (𝜑 ↔ 𝜓)) |
no2indslem.2 | ⊢ (𝑦 = 𝑤 → (𝜓 ↔ 𝜒)) |
no2indslem.3 | ⊢ (𝑥 = 𝑧 → (𝜃 ↔ 𝜒)) |
no2indslem.4 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜏)) |
no2indslem.5 | ⊢ (𝑦 = 𝐵 → (𝜏 ↔ 𝜂)) |
no2indslem.i | ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → ((∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒 ∧ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))𝜓 ∧ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜃) → 𝜑)) |
Ref | Expression |
---|---|
no2indslem | ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → 𝜂) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | no2indslem.a | . . 3 ⊢ 𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))} | |
2 | 1 | lrrecfr 27878 | . 2 ⊢ 𝑅 Fr No |
3 | 1 | lrrecpo 27876 | . 2 ⊢ 𝑅 Po No |
4 | 1 | lrrecse 27877 | . 2 ⊢ 𝑅 Se No |
5 | no2indslem.1 | . 2 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ 𝜓)) | |
6 | no2indslem.2 | . 2 ⊢ (𝑦 = 𝑤 → (𝜓 ↔ 𝜒)) | |
7 | no2indslem.3 | . 2 ⊢ (𝑥 = 𝑧 → (𝜃 ↔ 𝜒)) | |
8 | no2indslem.4 | . 2 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜏)) | |
9 | no2indslem.5 | . 2 ⊢ (𝑦 = 𝐵 → (𝜏 ↔ 𝜂)) | |
10 | 1 | lrrecpred 27879 | . . . . . 6 ⊢ (𝑥 ∈ No → Pred(𝑅, No , 𝑥) = (( L ‘𝑥) ∪ ( R ‘𝑥))) |
11 | 10 | adantr 479 | . . . . 5 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → Pred(𝑅, No , 𝑥) = (( L ‘𝑥) ∪ ( R ‘𝑥))) |
12 | 1 | lrrecpred 27879 | . . . . . . 7 ⊢ (𝑦 ∈ No → Pred(𝑅, No , 𝑦) = (( L ‘𝑦) ∪ ( R ‘𝑦))) |
13 | 12 | adantl 480 | . . . . . 6 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → Pred(𝑅, No , 𝑦) = (( L ‘𝑦) ∪ ( R ‘𝑦))) |
14 | 13 | raleqdv 3315 | . . . . 5 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → (∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜒 ↔ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒)) |
15 | 11, 14 | raleqbidv 3330 | . . . 4 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → (∀𝑧 ∈ Pred (𝑅, No , 𝑥)∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜒 ↔ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒)) |
16 | 11 | raleqdv 3315 | . . . 4 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → (∀𝑧 ∈ Pred (𝑅, No , 𝑥)𝜓 ↔ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))𝜓)) |
17 | 13 | raleqdv 3315 | . . . 4 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → (∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜃 ↔ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜃)) |
18 | 15, 16, 17 | 3anbi123d 1432 | . . 3 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → ((∀𝑧 ∈ Pred (𝑅, No , 𝑥)∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜒 ∧ ∀𝑧 ∈ Pred (𝑅, No , 𝑥)𝜓 ∧ ∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜃) ↔ (∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒 ∧ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))𝜓 ∧ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜃))) |
19 | no2indslem.i | . . 3 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → ((∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒 ∧ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))𝜓 ∧ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜃) → 𝜑)) | |
20 | 18, 19 | sylbid 239 | . 2 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → ((∀𝑧 ∈ Pred (𝑅, No , 𝑥)∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜒 ∧ ∀𝑧 ∈ Pred (𝑅, No , 𝑥)𝜓 ∧ ∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜃) → 𝜑)) |
21 | 2, 3, 4, 2, 3, 4, 5, 6, 7, 8, 9, 20 | xpord2ind 8151 | 1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → 𝜂) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∀wral 3051 ∪ cun 3937 {copab 5205 Predcpred 6299 ‘cfv 6543 No csur 27591 L cleft 27790 R cright 27791 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7738 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3769 df-csb 3885 df-dif 3942 df-un 3944 df-in 3946 df-ss 3956 df-pss 3959 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-int 4945 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-se 5628 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7372 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7991 df-2nd 7992 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-1o 8485 df-2o 8486 df-no 27594 df-slt 27595 df-bday 27596 df-sslt 27732 df-scut 27734 df-made 27792 df-old 27793 df-left 27795 df-right 27796 |
This theorem is referenced by: no2inds 27890 |
Copyright terms: Public domain | W3C validator |