Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sprsymrelf1lem Structured version   Visualization version   GIF version

Theorem sprsymrelf1lem 47365
Description: Lemma for sprsymrelf1 47370. (Contributed by AV, 22-Nov-2021.)
Assertion
Ref Expression
sprsymrelf1lem ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎𝑏))
Distinct variable groups:   𝑉,𝑐   𝑎,𝑏,𝑐,𝑥,𝑦
Allowed substitution hints:   𝑉(𝑥,𝑦,𝑎,𝑏)

Proof of Theorem sprsymrelf1lem
Dummy variables 𝑝 𝑖 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prssspr 47359 . . . . . 6 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑝𝑎) → ∃𝑖𝑉𝑗𝑉 𝑝 = {𝑖, 𝑗})
21ad4ant14 751 . . . . 5 ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → ∃𝑖𝑉𝑗𝑉 𝑝 = {𝑖, 𝑗})
3 simpr 484 . . . . . . . . . . . 12 (((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 = {𝑖, 𝑗})
43adantr 480 . . . . . . . . . . 11 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → 𝑝 = {𝑖, 𝑗})
54eleq1d 2829 . . . . . . . . . 10 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (𝑝𝑎 ↔ {𝑖, 𝑗} ∈ 𝑎))
6 simpr 484 . . . . . . . . . . . . . 14 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) → {𝑖, 𝑗} ∈ 𝑎)
7 eqeq1 2744 . . . . . . . . . . . . . . 15 (𝑐 = {𝑖, 𝑗} → (𝑐 = {𝑖, 𝑗} ↔ {𝑖, 𝑗} = {𝑖, 𝑗}))
87adantl 481 . . . . . . . . . . . . . 14 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) ∧ 𝑐 = {𝑖, 𝑗}) → (𝑐 = {𝑖, 𝑗} ↔ {𝑖, 𝑗} = {𝑖, 𝑗}))
9 eqidd 2741 . . . . . . . . . . . . . 14 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) → {𝑖, 𝑗} = {𝑖, 𝑗})
106, 8, 9rspcedvd 3637 . . . . . . . . . . . . 13 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) → ∃𝑐𝑎 𝑐 = {𝑖, 𝑗})
1110adantlr 714 . . . . . . . . . . . 12 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) ∧ {𝑖, 𝑗} ∈ 𝑎) → ∃𝑐𝑎 𝑐 = {𝑖, 𝑗})
12 preq12 4760 . . . . . . . . . . . . . . . . 17 ((𝑥 = 𝑖𝑦 = 𝑗) → {𝑥, 𝑦} = {𝑖, 𝑗})
1312eqeq2d 2751 . . . . . . . . . . . . . . . 16 ((𝑥 = 𝑖𝑦 = 𝑗) → (𝑐 = {𝑥, 𝑦} ↔ 𝑐 = {𝑖, 𝑗}))
1413rexbidv 3185 . . . . . . . . . . . . . . 15 ((𝑥 = 𝑖𝑦 = 𝑗) → (∃𝑐𝑎 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐𝑎 𝑐 = {𝑖, 𝑗}))
1514opelopabga 5552 . . . . . . . . . . . . . 14 ((𝑖𝑉𝑗𝑉) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑐𝑎 𝑐 = {𝑖, 𝑗}))
1615bicomd 223 . . . . . . . . . . . . 13 ((𝑖𝑉𝑗𝑉) → (∃𝑐𝑎 𝑐 = {𝑖, 𝑗} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
1716ad3antrrr 729 . . . . . . . . . . . 12 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) ∧ {𝑖, 𝑗} ∈ 𝑎) → (∃𝑐𝑎 𝑐 = {𝑖, 𝑗} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
1811, 17mpbid 232 . . . . . . . . . . 11 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) ∧ {𝑖, 𝑗} ∈ 𝑎) → ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}})
1918ex 412 . . . . . . . . . 10 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → ({𝑖, 𝑗} ∈ 𝑎 → ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
205, 19sylbid 240 . . . . . . . . 9 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (𝑝𝑎 → ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
21 eleq2 2833 . . . . . . . . . . 11 ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}))
2221ad2antll 728 . . . . . . . . . 10 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}))
2313rexbidv 3185 . . . . . . . . . . . . 13 ((𝑥 = 𝑖𝑦 = 𝑗) → (∃𝑐𝑏 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐𝑏 𝑐 = {𝑖, 𝑗}))
2423opelopabga 5552 . . . . . . . . . . . 12 ((𝑖 ∈ V ∧ 𝑗 ∈ V) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑐𝑏 𝑐 = {𝑖, 𝑗}))
2524el2v 3495 . . . . . . . . . . 11 (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑐𝑏 𝑐 = {𝑖, 𝑗})
26 eqtr3 2766 . . . . . . . . . . . . . . . . . . . . 21 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → 𝑝 = 𝑐)
2726equcomd 2018 . . . . . . . . . . . . . . . . . . . 20 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → 𝑐 = 𝑝)
2827eleq1d 2829 . . . . . . . . . . . . . . . . . . 19 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → (𝑐𝑏𝑝𝑏))
2928biimpd 229 . . . . . . . . . . . . . . . . . 18 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → (𝑐𝑏𝑝𝑏))
3029ex 412 . . . . . . . . . . . . . . . . 17 (𝑝 = {𝑖, 𝑗} → (𝑐 = {𝑖, 𝑗} → (𝑐𝑏𝑝𝑏)))
3130com13 88 . . . . . . . . . . . . . . . 16 (𝑐𝑏 → (𝑐 = {𝑖, 𝑗} → (𝑝 = {𝑖, 𝑗} → 𝑝𝑏)))
3231imp 406 . . . . . . . . . . . . . . 15 ((𝑐𝑏𝑐 = {𝑖, 𝑗}) → (𝑝 = {𝑖, 𝑗} → 𝑝𝑏))
3332rexlimiva 3153 . . . . . . . . . . . . . 14 (∃𝑐𝑏 𝑐 = {𝑖, 𝑗} → (𝑝 = {𝑖, 𝑗} → 𝑝𝑏))
3433com12 32 . . . . . . . . . . . . 13 (𝑝 = {𝑖, 𝑗} → (∃𝑐𝑏 𝑐 = {𝑖, 𝑗} → 𝑝𝑏))
3534adantl 481 . . . . . . . . . . . 12 (((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) → (∃𝑐𝑏 𝑐 = {𝑖, 𝑗} → 𝑝𝑏))
3635adantr 480 . . . . . . . . . . 11 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (∃𝑐𝑏 𝑐 = {𝑖, 𝑗} → 𝑝𝑏))
3725, 36biimtrid 242 . . . . . . . . . 10 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑝𝑏))
3822, 37sylbid 240 . . . . . . . . 9 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} → 𝑝𝑏))
3920, 38syld 47 . . . . . . . 8 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (𝑝𝑎𝑝𝑏))
4039expimpd 453 . . . . . . 7 (((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) → ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → 𝑝𝑏))
4140rexlimdva2 3163 . . . . . 6 (𝑖𝑉 → (∃𝑗𝑉 𝑝 = {𝑖, 𝑗} → ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → 𝑝𝑏)))
4241rexlimiv 3154 . . . . 5 (∃𝑖𝑉𝑗𝑉 𝑝 = {𝑖, 𝑗} → ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → 𝑝𝑏))
432, 42mpcom 38 . . . 4 ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → 𝑝𝑏)
4443ex 412 . . 3 (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) → (𝑝𝑎𝑝𝑏))
4544ssrdv 4014 . 2 (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑎𝑏)
4645ex 412 1 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎𝑏))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  wrex 3076  Vcvv 3488  wss 3976  {cpr 4650  cop 4654  {copab 5228  cfv 6573  Pairscspr 47351
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fv 6581  df-spr 47352
This theorem is referenced by:  sprsymrelf1  47370
  Copyright terms: Public domain W3C validator