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

Theorem usgredg2vlem2 26005
 Description: Lemma 2 for usgredg2v 26006. (Contributed by Alexander van der Vekens, 4-Jan-2018.) (Revised by AV, 18-Oct-2020.)
Hypotheses
Ref Expression
usgredg2v.v 𝑉 = (Vtx‘𝐺)
usgredg2v.e 𝐸 = (iEdg‘𝐺)
usgredg2v.a 𝐴 = {𝑥 ∈ dom 𝐸𝑁 ∈ (𝐸𝑥)}
Assertion
Ref Expression
usgredg2vlem2 ((𝐺 ∈ USGraph ∧ 𝑌𝐴) → (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (𝐸𝑌) = {𝐼, 𝑁}))
Distinct variable groups:   𝑥,𝐸,𝑧   𝑧,𝐺   𝑥,𝑁,𝑧   𝑧,𝑉   𝑥,𝑌,𝑧   𝑧,𝐼
Allowed substitution hints:   𝐴(𝑥,𝑧)   𝐺(𝑥)   𝐼(𝑥)   𝑉(𝑥)

Proof of Theorem usgredg2vlem2
StepHypRef Expression
1 fveq2 6150 . . . . . 6 (𝑥 = 𝑌 → (𝐸𝑥) = (𝐸𝑌))
21eleq2d 2689 . . . . 5 (𝑥 = 𝑌 → (𝑁 ∈ (𝐸𝑥) ↔ 𝑁 ∈ (𝐸𝑌)))
3 usgredg2v.a . . . . 5 𝐴 = {𝑥 ∈ dom 𝐸𝑁 ∈ (𝐸𝑥)}
42, 3elrab2 3353 . . . 4 (𝑌𝐴 ↔ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))
54biimpi 206 . . 3 (𝑌𝐴 → (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))
6 usgredg2v.v . . . . . . . 8 𝑉 = (Vtx‘𝐺)
7 usgredg2v.e . . . . . . . 8 𝐸 = (iEdg‘𝐺)
86, 7usgredgreu 25997 . . . . . . 7 ((𝐺 ∈ USGraph ∧ 𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)) → ∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧})
983expb 1263 . . . . . 6 ((𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌))) → ∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧})
106, 7, 3usgredg2vlem1 26004 . . . . . . . . . . . . . . 15 ((𝐺 ∈ USGraph ∧ 𝑌𝐴) → (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) ∈ 𝑉)
1110adantlr 750 . . . . . . . . . . . . . 14 (((𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌))) ∧ 𝑌𝐴) → (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) ∈ 𝑉)
1211ad4ant23 1294 . . . . . . . . . . . . 13 ((((∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} ∧ (𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))) ∧ 𝑌𝐴) ∧ 𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁})) → (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) ∈ 𝑉)
13 eleq1 2692 . . . . . . . . . . . . . 14 (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (𝐼𝑉 ↔ (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) ∈ 𝑉))
1413adantl 482 . . . . . . . . . . . . 13 ((((∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} ∧ (𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))) ∧ 𝑌𝐴) ∧ 𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁})) → (𝐼𝑉 ↔ (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) ∈ 𝑉))
1512, 14mpbird 247 . . . . . . . . . . . 12 ((((∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} ∧ (𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))) ∧ 𝑌𝐴) ∧ 𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁})) → 𝐼𝑉)
16 prcom 4242 . . . . . . . . . . . . . . . 16 {𝑁, 𝑧} = {𝑧, 𝑁}
1716eqeq2i 2638 . . . . . . . . . . . . . . 15 ((𝐸𝑌) = {𝑁, 𝑧} ↔ (𝐸𝑌) = {𝑧, 𝑁})
1817reubii 3122 . . . . . . . . . . . . . 14 (∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} ↔ ∃!𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁})
1918biimpi 206 . . . . . . . . . . . . 13 (∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} → ∃!𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁})
2019ad3antrrr 765 . . . . . . . . . . . 12 ((((∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} ∧ (𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))) ∧ 𝑌𝐴) ∧ 𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁})) → ∃!𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁})
21 preq1 4243 . . . . . . . . . . . . . 14 (𝑧 = 𝐼 → {𝑧, 𝑁} = {𝐼, 𝑁})
2221eqeq2d 2636 . . . . . . . . . . . . 13 (𝑧 = 𝐼 → ((𝐸𝑌) = {𝑧, 𝑁} ↔ (𝐸𝑌) = {𝐼, 𝑁}))
2322riota2 6588 . . . . . . . . . . . 12 ((𝐼𝑉 ∧ ∃!𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → ((𝐸𝑌) = {𝐼, 𝑁} ↔ (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) = 𝐼))
2415, 20, 23syl2anc 692 . . . . . . . . . . 11 ((((∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} ∧ (𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))) ∧ 𝑌𝐴) ∧ 𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁})) → ((𝐸𝑌) = {𝐼, 𝑁} ↔ (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) = 𝐼))
2524exbiri 651 . . . . . . . . . 10 (((∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} ∧ (𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))) ∧ 𝑌𝐴) → (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → ((𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) = 𝐼 → (𝐸𝑌) = {𝐼, 𝑁})))
2625com13 88 . . . . . . . . 9 ((𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) = 𝐼 → (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (((∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} ∧ (𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))) ∧ 𝑌𝐴) → (𝐸𝑌) = {𝐼, 𝑁})))
2726eqcoms 2634 . . . . . . . 8 (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (((∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} ∧ (𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))) ∧ 𝑌𝐴) → (𝐸𝑌) = {𝐼, 𝑁})))
2827pm2.43i 52 . . . . . . 7 (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (((∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} ∧ (𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))) ∧ 𝑌𝐴) → (𝐸𝑌) = {𝐼, 𝑁}))
2928expdcom 455 . . . . . 6 ((∃!𝑧𝑉 (𝐸𝑌) = {𝑁, 𝑧} ∧ (𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)))) → (𝑌𝐴 → (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (𝐸𝑌) = {𝐼, 𝑁})))
309, 29mpancom 702 . . . . 5 ((𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌))) → (𝑌𝐴 → (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (𝐸𝑌) = {𝐼, 𝑁})))
3130expcom 451 . . . 4 ((𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)) → (𝐺 ∈ USGraph → (𝑌𝐴 → (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (𝐸𝑌) = {𝐼, 𝑁}))))
3231com23 86 . . 3 ((𝑌 ∈ dom 𝐸𝑁 ∈ (𝐸𝑌)) → (𝑌𝐴 → (𝐺 ∈ USGraph → (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (𝐸𝑌) = {𝐼, 𝑁}))))
335, 32mpcom 38 . 2 (𝑌𝐴 → (𝐺 ∈ USGraph → (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (𝐸𝑌) = {𝐼, 𝑁})))
3433impcom 446 1 ((𝐺 ∈ USGraph ∧ 𝑌𝐴) → (𝐼 = (𝑧𝑉 (𝐸𝑌) = {𝑧, 𝑁}) → (𝐸𝑌) = {𝐼, 𝑁}))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1480   ∈ wcel 1992  ∃!wreu 2914  {crab 2916  {cpr 4155  dom cdm 5079  ‘cfv 5850  ℩crio 6565  Vtxcvtx 25769  iEdgciedg 25770   USGraph cusgr 25932 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1841  ax-6 1890  ax-7 1937  ax-8 1994  ax-9 2001  ax-10 2021  ax-11 2036  ax-12 2049  ax-13 2250  ax-ext 2606  ax-rep 4736  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6903  ax-cnex 9937  ax-resscn 9938  ax-1cn 9939  ax-icn 9940  ax-addcl 9941  ax-addrcl 9942  ax-mulcl 9943  ax-mulrcl 9944  ax-mulcom 9945  ax-addass 9946  ax-mulass 9947  ax-distr 9948  ax-i2m1 9949  ax-1ne0 9950  ax-1rid 9951  ax-rnegex 9952  ax-rrecex 9953  ax-cnre 9954  ax-pre-lttri 9955  ax-pre-lttrn 9956  ax-pre-ltadd 9957  ax-pre-mulgt0 9958 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1883  df-eu 2478  df-mo 2479  df-clab 2613  df-cleq 2619  df-clel 2622  df-nfc 2756  df-ne 2797  df-nel 2900  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3193  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-pss 3576  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-tp 4158  df-op 4160  df-uni 4408  df-int 4446  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-tr 4718  df-eprel 4990  df-id 4994  df-po 5000  df-so 5001  df-fr 5038  df-we 5040  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-pred 5642  df-ord 5688  df-on 5689  df-lim 5690  df-suc 5691  df-iota 5813  df-fun 5852  df-fn 5853  df-f 5854  df-f1 5855  df-fo 5856  df-f1o 5857  df-fv 5858  df-riota 6566  df-ov 6608  df-oprab 6609  df-mpt2 6610  df-om 7014  df-1st 7116  df-2nd 7117  df-wrecs 7353  df-recs 7414  df-rdg 7452  df-1o 7506  df-2o 7507  df-oadd 7510  df-er 7688  df-en 7901  df-dom 7902  df-sdom 7903  df-fin 7904  df-card 8710  df-cda 8935  df-pnf 10021  df-mnf 10022  df-xr 10023  df-ltxr 10024  df-le 10025  df-sub 10213  df-neg 10214  df-nn 10966  df-2 11024  df-n0 11238  df-z 11323  df-uz 11632  df-fz 12266  df-hash 13055  df-edg 25835  df-umgr 25869  df-usgr 25934 This theorem is referenced by:  usgredg2v  26006
 Copyright terms: Public domain W3C validator