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 47489
Description: Lemma for sprsymrelf1 47494. (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 47483 . . . . . 6 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑝𝑎) → ∃𝑖𝑉𝑗𝑉 𝑝 = {𝑖, 𝑗})
21ad4ant14 752 . . . . 5 ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → ∃𝑖𝑉𝑗𝑉 𝑝 = {𝑖, 𝑗})
3 simpr 484 . . . . . . . . . . . 12 (((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) → 𝑝 = {𝑖, 𝑗})
43adantr 480 . . . . . . . . . . 11 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → 𝑝 = {𝑖, 𝑗})
54eleq1d 2813 . . . . . . . . . 10 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (𝑝𝑎 ↔ {𝑖, 𝑗} ∈ 𝑎))
6 simpr 484 . . . . . . . . . . . . . 14 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) → {𝑖, 𝑗} ∈ 𝑎)
7 eqeq1 2733 . . . . . . . . . . . . . . 15 (𝑐 = {𝑖, 𝑗} → (𝑐 = {𝑖, 𝑗} ↔ {𝑖, 𝑗} = {𝑖, 𝑗}))
87adantl 481 . . . . . . . . . . . . . 14 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) ∧ 𝑐 = {𝑖, 𝑗}) → (𝑐 = {𝑖, 𝑗} ↔ {𝑖, 𝑗} = {𝑖, 𝑗}))
9 eqidd 2730 . . . . . . . . . . . . . 14 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) → {𝑖, 𝑗} = {𝑖, 𝑗})
106, 8, 9rspcedvd 3590 . . . . . . . . . . . . 13 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ {𝑖, 𝑗} ∈ 𝑎) → ∃𝑐𝑎 𝑐 = {𝑖, 𝑗})
1110adantlr 715 . . . . . . . . . . . 12 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) ∧ {𝑖, 𝑗} ∈ 𝑎) → ∃𝑐𝑎 𝑐 = {𝑖, 𝑗})
12 preq12 4699 . . . . . . . . . . . . . . . . 17 ((𝑥 = 𝑖𝑦 = 𝑗) → {𝑥, 𝑦} = {𝑖, 𝑗})
1312eqeq2d 2740 . . . . . . . . . . . . . . . 16 ((𝑥 = 𝑖𝑦 = 𝑗) → (𝑐 = {𝑥, 𝑦} ↔ 𝑐 = {𝑖, 𝑗}))
1413rexbidv 3157 . . . . . . . . . . . . . . 15 ((𝑥 = 𝑖𝑦 = 𝑗) → (∃𝑐𝑎 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐𝑎 𝑐 = {𝑖, 𝑗}))
1514opelopabga 5493 . . . . . . . . . . . . . 14 ((𝑖𝑉𝑗𝑉) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑐𝑎 𝑐 = {𝑖, 𝑗}))
1615bicomd 223 . . . . . . . . . . . . 13 ((𝑖𝑉𝑗𝑉) → (∃𝑐𝑎 𝑐 = {𝑖, 𝑗} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
1716ad3antrrr 730 . . . . . . . . . . . 12 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) ∧ {𝑖, 𝑗} ∈ 𝑎) → (∃𝑐𝑎 𝑐 = {𝑖, 𝑗} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
1811, 17mpbid 232 . . . . . . . . . . 11 (((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) ∧ {𝑖, 𝑗} ∈ 𝑎) → ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}})
1918ex 412 . . . . . . . . . 10 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → ({𝑖, 𝑗} ∈ 𝑎 → ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
205, 19sylbid 240 . . . . . . . . 9 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (𝑝𝑎 → ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}}))
21 eleq2 2817 . . . . . . . . . . 11 ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}))
2221ad2antll 729 . . . . . . . . . 10 ((((𝑖𝑉𝑗𝑉) ∧ 𝑝 = {𝑖, 𝑗}) ∧ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}})) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} ↔ ⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}))
2313rexbidv 3157 . . . . . . . . . . . . 13 ((𝑥 = 𝑖𝑦 = 𝑗) → (∃𝑐𝑏 𝑐 = {𝑥, 𝑦} ↔ ∃𝑐𝑏 𝑐 = {𝑖, 𝑗}))
2423opelopabga 5493 . . . . . . . . . . . 12 ((𝑖 ∈ V ∧ 𝑗 ∈ V) → (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑐𝑏 𝑐 = {𝑖, 𝑗}))
2524el2v 3454 . . . . . . . . . . 11 (⟨𝑖, 𝑗⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} ↔ ∃𝑐𝑏 𝑐 = {𝑖, 𝑗})
26 eqtr3 2751 . . . . . . . . . . . . . . . . . . . . 21 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → 𝑝 = 𝑐)
2726equcomd 2019 . . . . . . . . . . . . . . . . . . . 20 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → 𝑐 = 𝑝)
2827eleq1d 2813 . . . . . . . . . . . . . . . . . . 19 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → (𝑐𝑏𝑝𝑏))
2928biimpd 229 . . . . . . . . . . . . . . . . . 18 ((𝑝 = {𝑖, 𝑗} ∧ 𝑐 = {𝑖, 𝑗}) → (𝑐𝑏𝑝𝑏))
3029ex 412 . . . . . . . . . . . . . . . . 17 (𝑝 = {𝑖, 𝑗} → (𝑐 = {𝑖, 𝑗} → (𝑐𝑏𝑝𝑏)))
3130com13 88 . . . . . . . . . . . . . . . 16 (𝑐𝑏 → (𝑐 = {𝑖, 𝑗} → (𝑝 = {𝑖, 𝑗} → 𝑝𝑏)))
3231imp 406 . . . . . . . . . . . . . . 15 ((𝑐𝑏𝑐 = {𝑖, 𝑗}) → (𝑝 = {𝑖, 𝑗} → 𝑝𝑏))
3332rexlimiva 3126 . . . . . . . . . . . . . 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 3136 . . . . . 6 (𝑖𝑉 → (∃𝑗𝑉 𝑝 = {𝑖, 𝑗} → ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → 𝑝𝑏)))
4241rexlimiv 3127 . . . . 5 (∃𝑖𝑉𝑗𝑉 𝑝 = {𝑖, 𝑗} → ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → 𝑝𝑏))
432, 42mpcom 38 . . . 4 ((((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) ∧ 𝑝𝑎) → 𝑝𝑏)
4443ex 412 . . 3 (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) → (𝑝𝑎𝑝𝑏))
4544ssrdv 3952 . 2 (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) ∧ {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}}) → 𝑎𝑏)
4645ex 412 1 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑏 ⊆ (Pairs‘𝑉)) → ({⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑎 𝑐 = {𝑥, 𝑦}} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑐𝑏 𝑐 = {𝑥, 𝑦}} → 𝑎𝑏))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wrex 3053  Vcvv 3447  wss 3914  {cpr 4591  cop 4595  {copab 5169  cfv 6511  Pairscspr 47475
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-iota 6464  df-fun 6513  df-fv 6519  df-spr 47476
This theorem is referenced by:  sprsymrelf1  47494
  Copyright terms: Public domain W3C validator