ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fundm2domnop0 GIF version

Theorem fundm2domnop0 11158
Description: A function with a domain containing (at least) two different elements is not an ordered pair. This theorem (which requires that (𝐺 ∖ {∅}) needs to be a function instead of 𝐺) is useful for proofs for extensible structures, see structn0fun 13158. (Contributed by AV, 12-Oct-2020.) (Revised by AV, 7-Jun-2021.) (Proof shortened by AV, 15-Nov-2021.)
Assertion
Ref Expression
fundm2domnop0 ((Fun (𝐺 ∖ {∅}) ∧ 2o ≼ dom 𝐺) → ¬ 𝐺 ∈ (V × V))

Proof of Theorem fundm2domnop0
Dummy variables 𝑎 𝑏 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 2dom 7023 . . 3 (2o ≼ dom 𝐺 → ∃𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺 ¬ 𝑎 = 𝑏)
2 elvv 4794 . . . . . . . 8 (𝐺 ∈ (V × V) ↔ ∃𝑥𝑦 𝐺 = ⟨𝑥, 𝑦⟩)
3 difeq1 3320 . . . . . . . . . . . . 13 (𝐺 = ⟨𝑥, 𝑦⟩ → (𝐺 ∖ {∅}) = (⟨𝑥, 𝑦⟩ ∖ {∅}))
43funeqd 5355 . . . . . . . . . . . 12 (𝐺 = ⟨𝑥, 𝑦⟩ → (Fun (𝐺 ∖ {∅}) ↔ Fun (⟨𝑥, 𝑦⟩ ∖ {∅})))
5 opwo0id 4347 . . . . . . . . . . . . . . 15 𝑥, 𝑦⟩ = (⟨𝑥, 𝑦⟩ ∖ {∅})
65eqcomi 2235 . . . . . . . . . . . . . 14 (⟨𝑥, 𝑦⟩ ∖ {∅}) = ⟨𝑥, 𝑦
76funeqi 5354 . . . . . . . . . . . . 13 (Fun (⟨𝑥, 𝑦⟩ ∖ {∅}) ↔ Fun ⟨𝑥, 𝑦⟩)
8 dmeq 4937 . . . . . . . . . . . . . . . . 17 (𝐺 = ⟨𝑥, 𝑦⟩ → dom 𝐺 = dom ⟨𝑥, 𝑦⟩)
98eleq2d 2301 . . . . . . . . . . . . . . . 16 (𝐺 = ⟨𝑥, 𝑦⟩ → (𝑎 ∈ dom 𝐺𝑎 ∈ dom ⟨𝑥, 𝑦⟩))
108eleq2d 2301 . . . . . . . . . . . . . . . 16 (𝐺 = ⟨𝑥, 𝑦⟩ → (𝑏 ∈ dom 𝐺𝑏 ∈ dom ⟨𝑥, 𝑦⟩))
119, 10anbi12d 473 . . . . . . . . . . . . . . 15 (𝐺 = ⟨𝑥, 𝑦⟩ → ((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) ↔ (𝑎 ∈ dom ⟨𝑥, 𝑦⟩ ∧ 𝑏 ∈ dom ⟨𝑥, 𝑦⟩)))
12 eqid 2231 . . . . . . . . . . . . . . . . . 18 𝑥, 𝑦⟩ = ⟨𝑥, 𝑦
13 vex 2806 . . . . . . . . . . . . . . . . . 18 𝑥 ∈ V
14 vex 2806 . . . . . . . . . . . . . . . . . 18 𝑦 ∈ V
1512, 13, 14funopdmsn 5842 . . . . . . . . . . . . . . . . 17 ((Fun ⟨𝑥, 𝑦⟩ ∧ 𝑎 ∈ dom ⟨𝑥, 𝑦⟩ ∧ 𝑏 ∈ dom ⟨𝑥, 𝑦⟩) → 𝑎 = 𝑏)
16153expb 1231 . . . . . . . . . . . . . . . 16 ((Fun ⟨𝑥, 𝑦⟩ ∧ (𝑎 ∈ dom ⟨𝑥, 𝑦⟩ ∧ 𝑏 ∈ dom ⟨𝑥, 𝑦⟩)) → 𝑎 = 𝑏)
1716expcom 116 . . . . . . . . . . . . . . 15 ((𝑎 ∈ dom ⟨𝑥, 𝑦⟩ ∧ 𝑏 ∈ dom ⟨𝑥, 𝑦⟩) → (Fun ⟨𝑥, 𝑦⟩ → 𝑎 = 𝑏))
1811, 17biimtrdi 163 . . . . . . . . . . . . . 14 (𝐺 = ⟨𝑥, 𝑦⟩ → ((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) → (Fun ⟨𝑥, 𝑦⟩ → 𝑎 = 𝑏)))
1918com23 78 . . . . . . . . . . . . 13 (𝐺 = ⟨𝑥, 𝑦⟩ → (Fun ⟨𝑥, 𝑦⟩ → ((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) → 𝑎 = 𝑏)))
207, 19biimtrid 152 . . . . . . . . . . . 12 (𝐺 = ⟨𝑥, 𝑦⟩ → (Fun (⟨𝑥, 𝑦⟩ ∖ {∅}) → ((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) → 𝑎 = 𝑏)))
214, 20sylbid 150 . . . . . . . . . . 11 (𝐺 = ⟨𝑥, 𝑦⟩ → (Fun (𝐺 ∖ {∅}) → ((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) → 𝑎 = 𝑏)))
2221impcomd 255 . . . . . . . . . 10 (𝐺 = ⟨𝑥, 𝑦⟩ → (((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) ∧ Fun (𝐺 ∖ {∅})) → 𝑎 = 𝑏))
2322exlimivv 1945 . . . . . . . . 9 (∃𝑥𝑦 𝐺 = ⟨𝑥, 𝑦⟩ → (((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) ∧ Fun (𝐺 ∖ {∅})) → 𝑎 = 𝑏))
2423com12 30 . . . . . . . 8 (((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) ∧ Fun (𝐺 ∖ {∅})) → (∃𝑥𝑦 𝐺 = ⟨𝑥, 𝑦⟩ → 𝑎 = 𝑏))
252, 24biimtrid 152 . . . . . . 7 (((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) ∧ Fun (𝐺 ∖ {∅})) → (𝐺 ∈ (V × V) → 𝑎 = 𝑏))
2625con3d 636 . . . . . 6 (((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) ∧ Fun (𝐺 ∖ {∅})) → (¬ 𝑎 = 𝑏 → ¬ 𝐺 ∈ (V × V)))
2726ex 115 . . . . 5 ((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) → (Fun (𝐺 ∖ {∅}) → (¬ 𝑎 = 𝑏 → ¬ 𝐺 ∈ (V × V))))
2827com23 78 . . . 4 ((𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺) → (¬ 𝑎 = 𝑏 → (Fun (𝐺 ∖ {∅}) → ¬ 𝐺 ∈ (V × V))))
2928rexlimivv 2657 . . 3 (∃𝑎 ∈ dom 𝐺𝑏 ∈ dom 𝐺 ¬ 𝑎 = 𝑏 → (Fun (𝐺 ∖ {∅}) → ¬ 𝐺 ∈ (V × V)))
301, 29syl 14 . 2 (2o ≼ dom 𝐺 → (Fun (𝐺 ∖ {∅}) → ¬ 𝐺 ∈ (V × V)))
3130impcom 125 1 ((Fun (𝐺 ∖ {∅}) ∧ 2o ≼ dom 𝐺) → ¬ 𝐺 ∈ (V × V))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104   = wceq 1398  wex 1541  wcel 2202  wrex 2512  Vcvv 2803  cdif 3198  c0 3496  {csn 3673  cop 3676   class class class wbr 4093   × cxp 4729  dom cdm 4731  Fun wfun 5327  2oc2o 6619  cdom 6951
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fv 5341  df-1o 6625  df-2o 6626  df-dom 6954
This theorem is referenced by:  fundm2domnop  11159  fun2dmnop0  11160  funvtxdm2domval  15953  funiedgdm2domval  15954
  Copyright terms: Public domain W3C validator