MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  no3inds Structured version   Visualization version   GIF version

Theorem no3inds 28039
Description: Triple induction over surreal numbers. (Contributed by Scott Fenton, 9-Oct-2024.)
Hypotheses
Ref Expression
no3inds.1 (𝑎 = 𝑑 → (𝜑𝜓))
no3inds.2 (𝑏 = 𝑒 → (𝜓𝜒))
no3inds.3 (𝑐 = 𝑓 → (𝜒𝜃))
no3inds.4 (𝑎 = 𝑑 → (𝜏𝜃))
no3inds.5 (𝑏 = 𝑒 → (𝜂𝜏))
no3inds.6 (𝑏 = 𝑒 → (𝜁𝜃))
no3inds.7 (𝑐 = 𝑓 → (𝜎𝜏))
no3inds.8 (𝑎 = 𝑋 → (𝜑𝜌))
no3inds.9 (𝑏 = 𝑌 → (𝜌𝜇))
no3inds.10 (𝑐 = 𝑍 → (𝜇𝜆))
no3inds.i ((𝑎 No 𝑏 No 𝑐 No ) → (((∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁) ∧ (∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))𝜓 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜎) ∧ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜂) → 𝜑))
Assertion
Ref Expression
no3inds ((𝑋 No 𝑌 No 𝑍 No ) → 𝜆)
Distinct variable groups:   𝑋,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝑌,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝑍,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝜓,𝑎   𝜌,𝑎   𝜃,𝑎,𝑏,𝑐   𝜒,𝑏,𝑓   𝜇,𝑏   𝜆,𝑐   𝜑,𝑑   𝜏,𝑑   𝜂,𝑒   𝜓,𝑒   𝜁,𝑒   𝜎,𝑓
Allowed substitution hints:   𝜑(𝑒,𝑓,𝑎,𝑏,𝑐)   𝜓(𝑓,𝑏,𝑐,𝑑)   𝜒(𝑒,𝑎,𝑐,𝑑)   𝜃(𝑒,𝑓,𝑑)   𝜏(𝑒,𝑓,𝑎,𝑏,𝑐)   𝜂(𝑓,𝑎,𝑏,𝑐,𝑑)   𝜁(𝑓,𝑎,𝑏,𝑐,𝑑)   𝜎(𝑒,𝑎,𝑏,𝑐,𝑑)   𝜌(𝑒,𝑓,𝑏,𝑐,𝑑)   𝜇(𝑒,𝑓,𝑎,𝑐,𝑑)   𝜆(𝑒,𝑓,𝑎,𝑏,𝑑)

Proof of Theorem no3inds
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2761 . . 3 {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))} = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}
21lrrecfr 28024 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))} Fr No
31lrrecpo 28022 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))} Po No
41lrrecse 28023 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))} Se No
5 no3inds.1 . 2 (𝑎 = 𝑑 → (𝜑𝜓))
6 no3inds.2 . 2 (𝑏 = 𝑒 → (𝜓𝜒))
7 no3inds.3 . 2 (𝑐 = 𝑓 → (𝜒𝜃))
8 no3inds.4 . 2 (𝑎 = 𝑑 → (𝜏𝜃))
9 no3inds.5 . 2 (𝑏 = 𝑒 → (𝜂𝜏))
10 no3inds.6 . 2 (𝑏 = 𝑒 → (𝜁𝜃))
11 no3inds.7 . 2 (𝑐 = 𝑓 → (𝜎𝜏))
12 no3inds.8 . 2 (𝑎 = 𝑋 → (𝜑𝜌))
13 no3inds.9 . 2 (𝑏 = 𝑌 → (𝜌𝜇))
14 no3inds.10 . 2 (𝑐 = 𝑍 → (𝜇𝜆))
151lrrecpred 28025 . . . . . . 7 (𝑎 No → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎) = (( L ‘𝑎) ∪ ( R ‘𝑎)))
16153ad2ant1 1145 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎) = (( L ‘𝑎) ∪ ( R ‘𝑎)))
171lrrecpred 28025 . . . . . . . 8 (𝑏 No → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏) = (( L ‘𝑏) ∪ ( R ‘𝑏)))
18173ad2ant2 1146 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏) = (( L ‘𝑏) ∪ ( R ‘𝑏)))
191lrrecpred 28025 . . . . . . . . 9 (𝑐 No → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐) = (( L ‘𝑐) ∪ ( R ‘𝑐)))
20193ad2ant3 1147 . . . . . . . 8 ((𝑎 No 𝑏 No 𝑐 No ) → Pred({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐) = (( L ‘𝑐) ∪ ( R ‘𝑐)))
2120raleqdv 3319 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ↔ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃))
2218, 21raleqbidv 3335 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ↔ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃))
2316, 22raleqbidv 3335 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ↔ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃))
2418raleqdv 3319 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜒 ↔ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒))
2516, 24raleqbidv 3335 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜒 ↔ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒))
2620raleqdv 3319 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜁 ↔ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁))
2716, 26raleqbidv 3335 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜁 ↔ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁))
2823, 25, 273anbi123d 1456 . . . 4 ((𝑎 No 𝑏 No 𝑐 No ) → ((∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜒 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜁) ↔ (∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁)))
2916raleqdv 3319 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)𝜓 ↔ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))𝜓))
3020raleqdv 3319 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜏 ↔ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏))
3118, 30raleqbidv 3335 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜏 ↔ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏))
3218raleqdv 3319 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜎 ↔ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜎))
3329, 31, 323anbi123d 1456 . . . 4 ((𝑎 No 𝑏 No 𝑐 No ) → ((∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)𝜓 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜏 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜎) ↔ (∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))𝜓 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜎)))
3420raleqdv 3319 . . . 4 ((𝑎 No 𝑏 No 𝑐 No ) → (∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜂 ↔ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜂))
3528, 33, 343anbi123d 1456 . . 3 ((𝑎 No 𝑏 No 𝑐 No ) → (((∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜒 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜁) ∧ (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)𝜓 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜏 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜎) ∧ ∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜂) ↔ ((∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁) ∧ (∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))𝜓 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜎) ∧ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜂)))
36 no3inds.i . . 3 ((𝑎 No 𝑏 No 𝑐 No ) → (((∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜃 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜒 ∧ ∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜁) ∧ (∀𝑑 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))𝜓 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜏 ∧ ∀𝑒 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))𝜎) ∧ ∀𝑓 ∈ (( L ‘𝑐) ∪ ( R ‘𝑐))𝜂) → 𝜑))
3735, 36sylbid 242 . 2 ((𝑎 No 𝑏 No 𝑐 No ) → (((∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜃 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜒 ∧ ∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜁) ∧ (∀𝑑 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑎)𝜓 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜏 ∧ ∀𝑒 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑏)𝜎) ∧ ∀𝑓 ∈ Pred ({⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}, No , 𝑐)𝜂) → 𝜑))
382, 3, 4, 2, 3, 4, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 37xpord3ind 8130 1 ((𝑋 No 𝑌 No 𝑍 No ) → 𝜆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  w3a 1097   = wceq 1559  wcel 2141  wral 3075  cun 3900  {copab 5159  Predcpred 6282  cfv 6516   No csur 27692   L cleft 27906   R cright 27907
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7713
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-ot 4588  df-uni 4863  df-int 4903  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-se 5597  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6283  df-ord 6344  df-on 6345  df-suc 6347  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-riota 7348  df-ov 7394  df-oprab 7395  df-mpo 7396  df-1st 7965  df-2nd 7966  df-frecs 8256  df-wrecs 8287  df-recs 8336  df-1o 8431  df-2o 8432  df-no 27695  df-lts 27696  df-bday 27697  df-slts 27839  df-cuts 27841  df-made 27908  df-old 27909  df-left 27911  df-right 27912
This theorem is referenced by:  leadds1  28070  addsass  28086  addsdi  28236  mulsass  28247
  Copyright terms: Public domain W3C validator