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

Theorem supisoex 9390
Description: Lemma for supiso 9391. (Contributed by Mario Carneiro, 24-Dec-2016.)
Hypotheses
Ref Expression
supiso.1 (𝜑𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵))
supiso.2 (𝜑𝐶𝐴)
supisoex.3 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)))
Assertion
Ref Expression
supisoex (𝜑 → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)))
Distinct variable groups:   𝑣,𝑢,𝑤,𝑥,𝑦,𝑧,𝐴   𝑢,𝐶,𝑣,𝑤,𝑥,𝑦,𝑧   𝜑,𝑢,𝑤   𝑢,𝐹,𝑣,𝑤,𝑥,𝑦,𝑧   𝑢,𝑅,𝑤,𝑥,𝑦,𝑧   𝑢,𝑆,𝑣,𝑤,𝑥,𝑦,𝑧   𝑢,𝐵,𝑣,𝑤,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑣)   𝑅(𝑣)

Proof of Theorem supisoex
StepHypRef Expression
1 supisoex.3 . 2 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)))
2 supiso.1 . . 3 (𝜑𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵))
3 supiso.2 . . 3 (𝜑𝐶𝐴)
4 simpl 482 . . . . . 6 ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) → 𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵))
5 simpr 484 . . . . . 6 ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) → 𝐶𝐴)
64, 5supisolem 9389 . . . . 5 (((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) ∧ 𝑥𝐴) → ((∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)) ↔ (∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
7 isof1o 7279 . . . . . . . 8 (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐹:𝐴1-1-onto𝐵)
8 f1of 6782 . . . . . . . 8 (𝐹:𝐴1-1-onto𝐵𝐹:𝐴𝐵)
94, 7, 83syl 18 . . . . . . 7 ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) → 𝐹:𝐴𝐵)
109ffvelcdmda 7038 . . . . . 6 (((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) ∧ 𝑥𝐴) → (𝐹𝑥) ∈ 𝐵)
11 breq1 5103 . . . . . . . . . . 11 (𝑢 = (𝐹𝑥) → (𝑢𝑆𝑤 ↔ (𝐹𝑥)𝑆𝑤))
1211notbid 318 . . . . . . . . . 10 (𝑢 = (𝐹𝑥) → (¬ 𝑢𝑆𝑤 ↔ ¬ (𝐹𝑥)𝑆𝑤))
1312ralbidv 3161 . . . . . . . . 9 (𝑢 = (𝐹𝑥) → (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ↔ ∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤))
14 breq2 5104 . . . . . . . . . . 11 (𝑢 = (𝐹𝑥) → (𝑤𝑆𝑢𝑤𝑆(𝐹𝑥)))
1514imbi1d 341 . . . . . . . . . 10 (𝑢 = (𝐹𝑥) → ((𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣) ↔ (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)))
1615ralbidv 3161 . . . . . . . . 9 (𝑢 = (𝐹𝑥) → (∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣) ↔ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)))
1713, 16anbi12d 633 . . . . . . . 8 (𝑢 = (𝐹𝑥) → ((∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)) ↔ (∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
1817rspcev 3578 . . . . . . 7 (((𝐹𝑥) ∈ 𝐵 ∧ (∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)))
1918ex 412 . . . . . 6 ((𝐹𝑥) ∈ 𝐵 → ((∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
2010, 19syl 17 . . . . 5 (((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) ∧ 𝑥𝐴) → ((∀𝑤 ∈ (𝐹𝐶) ¬ (𝐹𝑥)𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆(𝐹𝑥) → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
216, 20sylbid 240 . . . 4 (((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) ∧ 𝑥𝐴) → ((∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
2221rexlimdva 3139 . . 3 ((𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶𝐴) → (∃𝑥𝐴 (∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
232, 3, 22syl2anc 585 . 2 (𝜑 → (∃𝑥𝐴 (∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)) → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣))))
241, 23mpd 15 1 (𝜑 → ∃𝑢𝐵 (∀𝑤 ∈ (𝐹𝐶) ¬ 𝑢𝑆𝑤 ∧ ∀𝑤𝐵 (𝑤𝑆𝑢 → ∃𝑣 ∈ (𝐹𝐶)𝑤𝑆𝑣)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1542  wcel 2114  wral 3052  wrex 3062  wss 3903   class class class wbr 5100  cima 5635  wf 6496  1-1-ontowf1o 6499  cfv 6500   Isom wiso 6501
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-isom 6509
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator